منابع مشابه
Categorial grammar, modalities and algebraic semantics
This paper contributes to the theory of substructural logics .that are of interest to categorial grammarians. Combining semantic ideas of Hepple [1990] and Mor-rill [1990], proof-theoretic ideas of Venema [1993b; 1993a] and the theory of equational specifications, a class of resource-preserving logics is defined, for which decidability and completeness theorems are established.
متن کاملAlgebraic Specification of Type Raising in Categorial Grammar
hhCOLING2000-76ii Type raising has been recognized as an important mechanism of analyzing the noun phrase and other constituents. But lexical and dynamic treatment of type raising have problems with multiplicity and lack of formal basis, respectively. By adopting ideas in algebraic specification, this paper proposes a new way of formulating type raising that can eliminate the complications asso...
متن کاملCategorial Grammar
The paper is a review article comparing a number of approaches to natural language syntax and semantics that have been developed using categorial frameworks. It distinguishes two related but distinct varieties of categorial theory, one related to Natural Deduction systems and the axiomatic calculi of Lambek, and another which involves more specialized combinatory operations. Comments University...
متن کاملEfficient Realization of Coordinate Structures in Combinatory Categorial Grammar
We describe a chart realization algorithm for Combinatory Categorial Grammar (CCG), and show how it can be used to efficiently realize a wide range of coordination phenomena, including argument cluster coordination and gapping. The algorithm incorporates three novel methods for improving the efficiency of chart realization: (i) using rules to chunk the input logical form into sub-problems to be...
متن کاملConstraint-Based Categorial Grammar
We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In particular, the introduction of relational constraints allows one to capture the effects of (recursive) lexical rules in a computationally attractive manner. We illustrate the linguistic merits of the new approach by showing how it accounts for the syntax of Dutch cros...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00266-1